A Modified Adaptive Space-Sharing Policy for Non-dedicated Heterogeneous Cluster Systems
نویسندگان
چکیده
Adaptive space-sharing algorithms are commonly used to realize the fullest strengths of dedicated homogeneous cluster computing systems since they produce better performance than fixed and variable-space sharing policies. However cluster of computers tend to be heterogeneous over the time because of both nature of incremental growth and diversity of technological change. Community-owned clusters are not only heterogeneous but are also non-dedicated i.e. computational resources are shared between local and parallel workload. The existing adaptive policies for dedicated cluster systems are not suitable for such conditions. This paper modifies an existing adaptive policy for dedicated heterogeneous systems so that it can be adapted to work in non-dedicated heterogeneous systems. Evaluation results show that the proposed algorithm provide substantial improvement over existing similar algorithms at moderate to high system utilizations.
منابع مشابه
An Improved Adaptive Space-Sharing Scheduling Policy for Non-dedicated Heterogeneous Cluster Systems
Adaptive space-sharing scheduling algorithms tend to improve the performance of clusters by allocating processors to jobs based on the current system load. The focus of existing adaptive algorithms is on dedicated homogeneous and heterogeneous clusters. However commodity clusters are naturally non-dedicated and tend to be heterogeneous over the time as cluster hardware is usually upgraded and n...
متن کاملPerformance Evaluation of Adaptive Scheduling Algorithm for Shared Heterogeneous Cluster Systems
Cluster computing systems have recently generated enormous interest for providing easily scalable and cost-effective parallel computing solution for processing large-scale applications. Various adaptive space-sharing scheduling algorithms have been proposed to improve the performance of dedicated and homogeneous clusters. But commodity clusters are naturally nondedicated and tend to be heteroge...
متن کاملAn Adaptive Space-Sharing Policy for Heterogeneous Parallel Systems
As the distributed-memory parallel systems become heterogeneous in nature, it is important to devise scheduling policies that take node heterogeneity into account. Previous studies on this topic have focused on homogeneous systems. In this paper, we propose a new two-level space-sharing policy for heterogeneous systems. The proposed policy is an adaptive space-sharing policy that takes system l...
متن کاملParallel Job Scheduling Policy for Workstation Cluster Environments
As workstation clusters (WC) become more commonly used for parallel jobs, there is a growing awareness for the need of job scheduling policies. There have been a fair number of studies on how to schedule parallel applications on parallel systems and a good survey in the area can be found in [5]. It has been shown that the best solution to the processor allocation problem in a distributed multip...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کامل